On the Effect of Default Negation on the Expressiveness of Disjunctive Rules

نویسنده

  • Tomi Janhunen
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning with Constraints and Well-Founded Negation

Constraint reasoning and logic programming have been combined with great success. Constraint logic programming (CLP) [5] has gained a lot of interest, since it combines both fields in a theoretically sound manner while achieving efficiency by dedicated constraint solvers for practical applications. However in CLP, only Horn clauses are considered. But in many cases it is desirable also to have ...

متن کامل

Aggregation in Disjunctive Deductive Databases

Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...

متن کامل

Semantics for Disjunctive Logic Programs with Explicit and Default Negation

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...

متن کامل

First-Order Expressibility and Boundedness of Disjunctive Logic Programs

In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the propos...

متن کامل

Disjunctive Logic Programming and Possible Model Semantics

We use Kripke structures of autoepistemic logic to classify various semantics for disjunctive logic programs with default negation. We have observed that nonmonotonic reasoning can be characterized by Kripke structures whose beliefs are justiied. We also observed that two diierent types of negative introspection in autoepistemic reasoning present two diierent interpretations of default negation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001